Queue-length synchronization in communication networks.
نویسندگان
چکیده
We study the synchronization in the context of network traffic on a 2-d communication network with local clustering and geographic separations. The network consists of nodes and randomly distributed hubs where the top five hubs ranked according to their coefficient of betweenness centrality (CBC) are connected by random assortative and gradient mechanisms. For multiple message traffic, messages can trap at the high CBC hubs, and congestion can build up on the network with long queues at the congested hubs. The queue lengths are seen to synchronize in the congested phase. Both complete and phase synchronization are seen, between pairs of hubs. In the decongested phase, the pairs start clearing and synchronization is lost. A cascading master-slave relation is seen between the hubs, with the slower hubs (which are slow to decongest) driving the faster ones. These are usually the hubs of high CBC. Similar results are seen for traffic of constant density. Total synchronization between the hubs of high CBC is also seen in the congested regime. Similar behavior is seen for traffic on a network constructed using the Waxman random topology generator. We also demonstrate the existence of phase synchronization in real internet traffic data.
منابع مشابه
Research of advanced time synchronous system with network support
As networks have become an important infrastructure in everyday life in recent years, the need to increase the degree of quality control has also arisen. Because it is necessary to accurately understand the state of the network for quality control, time information on measurement equipment has become important. Consequently, we have aimed at improving the precision of time synchronization throu...
متن کاملQueue length synchronization in a communication network
Traffic flows on networks have been the subject of intensive study [1]. We study this problem in the context of a two dimensional lattice of nodes and hubs. When many messages flow on the lattice, hubs which lie on many message paths tend to get congested. We rank the hubs by their coefficient of betweenness centrality (CBC) [2] which is defined as the number of messages Nk running through a gi...
متن کاملImproving LoRaWAN Performance Using Reservation ALOHA
LoRaWAN is one of the new and updated standards for IoT applications. However, the expected high density of peripheral devices for each gateway, and the absence of an operative synchronization mechanism between the gateway and peripherals, all of which challenges the networks scalability. In this paper, we propose to normalize the communication of LoRaWAN networks using a Reservation-ALOHA (R-A...
متن کاملSynchronization for Complex Dynamic Networks with State and Coupling Time-Delays
This paper is concerned with the problem of synchronization for complex dynamic networks with state and coupling time-delays. Therefore, larger class and more complicated complex dynamic networks can be considered for the synchronization problem. Based on the Lyapunov-Krasovskii functional, a delay-independent criterion is obtained and formulated in the form of linear matrix inequalities (LMIs)...
متن کاملDi usion Approximation to Study the Flow Synchronizationin ATM Networks
Diiusion approximation is a method which consists in replacing a discrete valued process with an appropriate continuous one. Using this method, we study some problems related to the ow synchronization in ATM networks. We model the end-to-end transmission delay and introduce a synchronization station at the receiver level to compensate the dispersion eeect that can be drawn by the jitter phenome...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 79 5 Pt 2 شماره
صفحات -
تاریخ انتشار 2009